Optimal Decision Strategies for the Generalized <i>Cuckoo</i> Card Game

نویسندگان

چکیده

Cuckoo is a popular card game, which originated in France during the 15th century and then spread throughout Europe, where it currently well-known under distinct names with different variants. Cuckoo an imperfect information game-of-chance, makes research regarding its optimal strategies determination interesting. The rules are simple: each player receives covered from dealer; starting at dealer's left, looks own decides whether to exchange their or keep it; dealer plays last and, if card, draws random one remaining deck; player(s) lowest valued lose(s) round. We formulate gameplay mathematically provide analysis of decision policies. Different decks can be used for this e.g., standard 52-card deck Italian 40-card deck. generalize model arbitrary number decks' cards, suites, players. Lastly, through numerical simulations, we compare determined strategy against benchmarks, showing that outperforms naive policies approaches performance ideal oracle.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Guessing Strategies in a Quantum Card Game

Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice’s card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob’s best st...

متن کامل

Optimal, Approximately Optimal, and Fair Play of the Fowl Play Card Game

After introducing the jeopardy card game Fowl Play, we present equations for optimal two-player play, describe their solution with a variant of value iteration, and visualize the optimal play policy. Next, we discuss the approximation of optimal play and note that neural network learning can achieve a win rate within 1% of optimal play yet with a 5-orders-of-magnitude reduction in memory requir...

متن کامل

Optimal Strategies in Priced Timed Game Automata

Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove in addition that it is decida...

متن کامل

Approximating Game-Theoretic Optimal Strategies for Full-scale Poker

The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represent the game of 2player Texas Hold’em, having size , using closely related models each having size . Despite the reduction in size by a factor of 100 billion, the resulting models retain the key properties and structure ...

متن کامل

Optimal strategies for a game on amenable semigroups

The semigroup game is a two-person zero-sum game defined on a semigroup (S, ·) as follows: Players 1 and 2 choose elements x ∈ S and y ∈ S, respectively, and player 1 receives a payoff f(xy) defined by a function f : S → [−1, 1]. If the semigroup is amenable in the sense of Day and von Neumann, one can extend the set of classical strategies, namely countably additive probability measures on S, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on games

سال: 2023

ISSN: ['2475-1502', '2475-1510']

DOI: https://doi.org/10.1109/tg.2023.3239795